Optimized Implementation and Analysis of CHAM in Quantum Computing

A quantum computer capable of running the Grover search algorithm, which reduces complexity brute-force attacks by a square root, has potential to undermine security strength symmetric-key cryptography and hash functions. Recently, studies on approaches have proposed analyzing using algorithm in conjunction with optimized circuit implementations for Analyzing cipher (i.e., cryptanalysis) estimating necessary resources are related evaluating post-quantum target algorithms. In this paper, we revisit CHAM block cipher, an ultra lightweight focus optimizing linear operations its key schedule. We equations as matrices applying novel decomposition techniques. Using improved circuits, estimate cost Grover’s evaluate further reduced costs.